// Given a string s consists of upper/lower-case alphabets and empty space characters ' ', return the length of last word in the string.
// 
// If the last word does not exist, return 0.
// 
// Note: A word is defined as a character sequence consists of non-space characters only.
// 
// For example, 
// Given s = "Hello World",
// return 5.


class Solution {
public:
int lengthOfLastWord(string s) {

	int nstringlen = s.size();

	if (nstringlen == 0)
	{
		return 0;
	}

	int flag = 0;
	for (; nstringlen >0; nstringlen--)
	{
		if (s[nstringlen-1] == ' ')
		{
			if (flag == 0)
			{
				continue;
			}
			else
			{
				break;
			}
		}
		flag++;

	}
	return  flag;
}
};